0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n013.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1440
0.13/0.34	% WCLimit    : 180
0.13/0.34	% DateTime   : Thu Jul  4 07:45:39 EDT 2024
0.13/0.34	% CPUTime    : 
0.20/0.48	Running higher-order theorem proving
0.20/0.48	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.fsWbPN809Z/E---3.1_14495.p
0.20/0.50	# Version: 3.2.0-ho
0.20/0.50	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.50	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting post_as_ho12 with 180s (1) cores
0.20/0.50	# Starting new_bool_9 with 180s (1) cores
0.20/0.50	# Starting post_as_ho1 with 180s (1) cores
0.20/0.50	# Starting post_as_ho4 with 180s (1) cores
0.20/0.50	# Starting post_as_ho2 with 180s (1) cores
0.20/0.50	# Starting ehoh_best2_full_lfho with 180s (1) cores
0.20/0.50	# Starting full_lambda_10 with 180s (1) cores
0.20/0.50	# Starting new_ho_8 with 180s (1) cores
0.20/0.50	# post_as_ho1 with pid 14597 completed with status 0
0.20/0.50	# Result found by post_as_ho1
0.20/0.50	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.50	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting post_as_ho12 with 180s (1) cores
0.20/0.50	# Starting new_bool_9 with 180s (1) cores
0.20/0.50	# Starting post_as_ho1 with 180s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HGUSF-FFSF11-SSSFFMBN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.50	# Starting post_as_ho4 with 98s (1) cores
0.20/0.50	# post_as_ho4 with pid 14603 completed with status 0
0.20/0.50	# Result found by post_as_ho4
0.20/0.50	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.50	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting post_as_ho12 with 180s (1) cores
0.20/0.50	# Starting new_bool_9 with 180s (1) cores
0.20/0.50	# Starting post_as_ho1 with 180s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HGUSF-FFSF11-SSSFFMBN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.50	# Starting post_as_ho4 with 98s (1) cores
0.20/0.50	# Preprocessing time       : 0.001 s
0.20/0.50	# Presaturation interreduction done
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(decl_22, type, b: $i).
0.20/0.50	thf(decl_23, type, cP: $i > $o).
0.20/0.50	thf(decl_24, type, a: $i).
0.20/0.50	thf(decl_25, type, esk1_1: ($i > $o) > $i).
0.20/0.50	thf(cBLEDSOE6, conjecture, ?[X1:$i > $o]:((((cP @ a)&((a)!=(b)))=>((~((X1 @ b))&?[X2:$i]:((X1 @ X2)))&![X3:$i]:(((X1 @ X3)=>(cP @ X3)))))), file('/export/starexec/sandbox2/tmp/tmp.fsWbPN809Z/E---3.1_14495.p', cBLEDSOE6)).
0.20/0.50	thf(c_0_1, negated_conjecture, ~(?[X1:$i > $o]:((((cP @ a)&((a)!=(b)))=>((~((X1 @ b))&?[X2:$i]:((X1 @ X2)))&![X3:$i]:(((X1 @ X3)=>(cP @ X3))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBLEDSOE6])])).
0.20/0.50	thf(c_0_2, negated_conjecture, ![X7:$i > $o, X8:$i]:((((cP @ a)&((a)!=(b)))&(((X7 @ (esk1_1 @ X7))|((X7 @ b)|~(X7 @ X8)))&(~(cP @ (esk1_1 @ X7))|((X7 @ b)|~(X7 @ X8)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])])).
0.20/0.50	thf(c_0_3, negated_conjecture, ![X1:$i > $o, X2:$i]:(((X1 @ b)|~((cP @ (esk1_1 @ X1)))|~((X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_4, negated_conjecture, ![X1:$i > $o, X2:$i]:(((X1 @ (esk1_1 @ X1))|(X1 @ b)|~((X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_5, negated_conjecture, ![X2:$i]:((((b)=(X2))|~((cP @ (esk1_1 @ (^[Z0/* 3 */:$i]:(((Z0)=(X2))))))))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_3])).
0.20/0.50	thf(c_0_6, negated_conjecture, ![X2:$i]:((((esk1_1 @ (^[Z0/* 3 */:$i]:(((Z0)=(X2)))))=(X2))|((b)=(X2)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_4])).
0.20/0.50	thf(c_0_7, negated_conjecture, ![X2:$i]:((((b)=(X2))|~((cP @ X2)))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
0.20/0.50	thf(c_0_8, negated_conjecture, (cP @ a), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_9, negated_conjecture, ((a)!=(b)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_10, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Parsed axioms                        : 4
0.20/0.50	# Removed by relevancy pruning/SinE    : 0
0.20/0.50	# Initial clauses                      : 7
0.20/0.50	# Removed in clause preprocessing      : 3
0.20/0.50	# Initial clauses in saturation        : 4
0.20/0.50	# Processed clauses                    : 18
0.20/0.50	# ...of these trivial                  : 0
0.20/0.50	# ...subsumed                          : 0
0.20/0.50	# ...remaining for further processing  : 18
0.20/0.50	# Other redundant clauses eliminated   : 0
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 0
0.20/0.50	# Backward-rewritten                   : 1
0.20/0.50	# Generated clauses                    : 37
0.20/0.50	# ...of the previous two non-redundant : 18
0.20/0.50	# ...aggressively subsumed             : 0
0.20/0.50	# Contextual simplify-reflections      : 1
0.20/0.50	# Paramodulations                      : 18
0.20/0.50	# Factorizations                       : 1
0.20/0.50	# NegExts                              : 0
0.20/0.50	# Equation resolutions                 : 4
0.20/0.50	# Disequality decompositions           : 0
0.20/0.50	# Total rewrite steps                  : 13
0.20/0.50	# ...of those cached                   : 11
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 13
0.20/0.50	#    Positive orientable unit clauses  : 2
0.20/0.50	#    Positive unorientable unit clauses: 0
0.20/0.50	#    Negative unit clauses             : 1
0.20/0.50	#    Non-unit-clauses                  : 10
0.20/0.50	# Current number of unprocessed clauses: 8
0.20/0.50	# ...number of literals in the above   : 20
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 5
0.20/0.50	# Clause-clause subsumption calls (NU) : 9
0.20/0.50	# Rec. Clause-clause subsumption calls : 9
0.20/0.50	# Non-unit clause-clause subsumptions  : 1
0.20/0.50	# Unit Clause-clause subsumption calls : 0
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 1
0.20/0.50	# BW rewrite match successes           : 1
0.20/0.50	# Condensation attempts                : 18
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 1456
0.20/0.50	# Search garbage collected termcells   : 109
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.002 s
0.20/0.50	# System time              : 0.001 s
0.20/0.50	# Total time               : 0.004 s
0.20/0.50	# Maximum resident set size: 1764 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.003 s
0.20/0.50	# System time              : 0.005 s
0.20/0.50	# Total time               : 0.007 s
0.20/0.50	# Maximum resident set size: 1700 pages
0.20/0.50	% E---3.1 exiting
0.20/0.50	% E exiting
0.20/0.50	EOF